Isometric sketching of any set via the Restricted Isometry Property
نویسندگان
چکیده
In this paper we show that for the purposes of dimensionality reduction certain class of structured random matrices behave similarly to random Gaussian matrices. This class includes several matrices for which matrix-vector multiply can be computed in log-linear time, providing efficient dimensionality reduction of general sets. In particular, we show that using such matrices any set from high dimensions can be embedded into lower dimensions with near optimal distortion. We obtain our results by connecting dimensionality reduction of any set to dimensionality reduction of sparse vectors via a chaining argument.
منابع مشابه
New and Improved Johnson-Lindenstrauss Embeddings via the Restricted Isometry Property
Consider anm×N matrix Φ with the Restricted Isometry Property of order k and level δ, that is, the norm of any k-sparse vector in R is preserved to within a multiplicative factor of 1±δ under application of Φ. We show that by randomizing the column signs of such a matrix Φ, the resulting map with high probability embeds any fixed set of p = O(e) points in R into R without distorting the norm of...
متن کاملNear optimal bound of orthogonal matching pursuit using restricted isometric constant
As a paradigm for reconstructing sparse signals using a set of under sampled measurements, compressed sensing has received much attention in recent years. In identifying the sufficient condition under which the perfect recovery of sparse signals is ensured, a property of the sensing matrix referred to as the restricted isometry property (RIP) is popularly employed. In this article, we propose t...
متن کاملThe Transverse Geometry of G-manifolds and Riemannian Foliations
Given a compact Riemannian manifold on which a compact Lie group acts by isometries, it is shown that there exists a Riemannian foliation whose leaf closure space is naturally isometric (as a metric space) to the orbit space of the group action. Furthermore, this isometry (and foliation) may be chosen so that a leaf closure is mapped to an orbit with the same volume, even though the dimension o...
متن کاملOn the Certification of the Restricted Isometry Property
Compressed sensing is a technique for finding sparse solutions to underdetermined linear systems. This technique relies on properties of the sensing matrix such as the restricted isometry property. Sensing matrices that satisfy this property with optimal parameters are mainly obtained via probabilistic arguments. Given any matrix, deciding whether it satisfies the restricted isometry property i...
متن کاملPractical Algorithms for Learning Near-Isometric Linear Embeddings
We propose two practical non-convex approaches for learning near-isometric, linear embeddings of finite sets of data points. Following Hegde, et. al. [6], given a set of training points X , we consider the secant set S(X ) that consists of all pairwise difference vectors of X , normalized to lie on the unit sphere. The problem can be formulated as finding a symmetric and positive semidefinite m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1506.03521 شماره
صفحات -
تاریخ انتشار 2015